Sparse Least Logarithmic Absolute Difference Algorithm with Correntropy-Induced Metric Penalty

نویسندگان

  • Wentao Ma
  • Badong Chen
  • Haiquan Zhao
  • Guan Gui
  • Jiandong Duan
  • José Carlos Príncipe
چکیده

Sparse adaptive filtering algorithms are utilized to exploit system sparsity as well as to mitigate interferences in many applications such as channel estimation and system identification. In order to improve the robustness of the sparse adaptive filtering, a novel adaptive filter is developed in this work by incorporating a correntropy-induced metric (CIM) constraint into the least logarithmic absolute difference (LLAD) algorithm. The CIM as an l0-norm approximation exerts a zero attraction, and hence, the B Badong Chen [email protected] Wentao Ma [email protected] Haiquan Zhao [email protected] Guan Gui [email protected] Jiandong Duan [email protected] Jose C. Principe [email protected] 1 School of Electronic and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China 2 School of Electrical Engineering, Southwest Jiaotong University, Chengdu, China 3 Department of Electronics and Information Systems, Akita Prefectural University, Yurihonjo 015-0055, Japan 4 Department of Electrical Engineering, Xi’an University of Technology, Xi’an 710048, China 5 Department of ECE, University of Florida, Gainesville, FL 32611, USA Circuits Syst Signal Process LLAD algorithm performs well with robustness against impulsive noises. Numerical simulation results show that the proposed algorithm may achieve much better performance than other robust and sparse adaptive filtering algorithms such as the least mean p-power algorithm with l1-norm or reweighted l1-norm constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Enhanced Set-Membership PNLMS Algorithm with a Correntropy Induced Metric Constraint for Acoustic Channel Estimation

In this paper, a sparse set-membership proportionate normalized least mean square (SM-PNLMS) algorithm integrated with a correntropy induced metric (CIM) penalty is proposed for acoustic channel estimation and echo cancellation. The CIM is used for constructing a new cost function within the kernel framework. The proposed CIM penalized SM-PNLMS (CIMSM-PNLMS) algorithm is derived and analyzed in...

متن کامل

Recursive Generalized Maximum Correntropy Criterion Algorithm with Sparse Penalty Constraints for System Identification

To address sparse system identification problem in non-Gaussian impulsive noise environment, the recursive generalized maximum correntropy criterion (RGMCC) algorithm with sparse penalty constraints is proposed to combat impulsive-inducing instability. Specifically, a recursive algorithm based on the generalized correntropy with a forgetting factor of error is developed to improve the performan...

متن کامل

A Robust Sparse Adaptive Filtering Algorithm with a Correntropy Induced Metric Constraint for Broadband Multi-Path Channel Estimation

A robust sparse least-mean mixture-norm (LMMN) algorithm is proposed, and its performance is appraised in the context of estimating a broadband multi-path wireless channel. The proposed algorithm is implemented via integrating a correntropy-induced metric (CIM) penalty into the conventional LMMN algorithm to modify the basic cost function, which is denoted as the CIM-based LMMN (CIM-LMMN) algor...

متن کامل

Convex regularized recursive maximum correntropy algorithm

In this brief, a robust and sparse recursive adaptive filtering algorithm, called convex regularized recursive maximum correntropy (CR-RMC), is derived by adding a general convex regularization penalty term to the maximum correntropy criterion (MCC). An approximate expression for automatically selecting the regularization parameter is also introduced. Simulation results show that the CR-RMC can...

متن کامل

Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments

Sparse adaptive channel estimation problem is one of the most important topics in broadband wireless communications systems due to its simplicity and robustness. So far many sparsity-aware channel estimation algorithms have been developed based on the well-known minimum mean square error (MMSE) criterion, such as the zero-attracting least mean square (ZALMS),which are robust under Gaussian assu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CSSP

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2016